δ-uniform BSS Machines
نویسندگان
چکیده
A δ-uniform BSS machine is a standard BSS machine which does not rely on exact equality tests. We prove that, for any real closed archimedean field R, a set is δ-uniformly semi-decidable iff it is open and semi-decidable by a BSS machine which is locally time bounded; we also prove that the local time bound condition is nontrivial. This entails a number of results about BSS machines, in particular the existence of decidable sets whose interior (closure) is not even semi-decidable without adding constants. Finally, we show that the sets semi-decidable by Turing machines are the sets semi-decidable by δ-uniform machines with coefficients in Q or T, the field of Turing computable numbers.
منابع مشابه
The Turing Closure of an Archimedean Field
A BSS machine is δ-uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turing machines for archimedean fields, and show that such fields admit nontrivial δ-uniformly decidable sets iff they are not Turing closed. Then, the partially ordered set of Turing closed fields is proved isomorphic to...
متن کاملRelativizations of the P =? DNP Question for the BSS Model
We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whether a tuple of real numbers belongs to a given oracle set O or not. We construct oracles such that the classes P and DNP relative to these oracles are equal or not equal.
متن کاملδ-approximable Functions
In this paper we study several notions of approximability of functions in the framework of the BSS model. Denoting with φδM the function computed by a BSS machine M when its comparisons are against −δ rather than 0, we study classes of functions f for which φδM → f in some sense (pointwise, uniformly, etc.). The main equivalence results show that this notion coincides with Type 2 computability ...
متن کاملThe Separation of Relativized Versions of P and DNP for the Ring of the Reals
We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whether a tuple of real numbers belongs to a given oracle set or not. We present oracle sets containing positive integers and pairs of numbers, respectively, such that the classes P and DNP relative to these oracles are not e...
متن کاملEquivalence of BSS scalar - and vector - recursion
BSS-computable functions can be approached in two ways: from the point of view of computations performed by machines or under the angle of the theory of recursive functions. The goal of this paper is to answer negatively a basic question of the theory of BSS-recursive functions, namely " is vector-recursion stronger than scalar recursion? "
متن کامل